Comparison of Di erent Neighbourhood Sizes in Simulated Annealing
نویسنده
چکیده
Neighbourhood structure and size are important parameters in local search algorithms. This is also true for generalised local search algorithms like simulated annealing. It has been shown that the performance of simulated annealing can be improved by adopting a suitable neighbourhood size. However, previous studies usually assumed that the neighbourhood size was xed during search. This paper presents a simulated annealing algorithm with a dynamic neighbourhood size which depends on the current \temperature" value during search. A method of dynamically deciding the neighbourhood size by approximating a continuous probability distribution is given. Four continuous probability distributions are used in our experiments to generate neighbourhood sizes dynamically, and the results are compared.
منابع مشابه
A Simulated Annealing Algorithm within the Variable Neighbourhood Search Framework to Solve the Capacitated Facility Location-Allocation Problem
In this study, we discuss the capacitated facility location-allocation problem with uncertain parameters in which the uncertainty is characterized by given finite numbers of scenarios. In this model, the objective function minimizes the total expected costs of transportation and opening facilities subject to the robustness constraint. To tackle the problem efficiently and effectively, an effici...
متن کاملDynamic Neighbourhood Size in Simulated Annealing
Simulated annealing has been shown to be a powerful stochastic method of tackling hard combinatorial optimisation problems, but it demands a vast amount of computation time to arrive at a good approximate solution. A lot of research has been done on the cooling schedule of simulated annealing to speed up its convergence, but only limited attention has been paid to the impact of the neighbourhoo...
متن کاملProblem Independent Distributed Simulated Annealing and its Applications
Simulated annealing has proven to be a good technique for solving hard combinatorial optimization problems. Some attempts at speeding up annealing algorithms have been based on shared memory multiprocessor systems. Also parallelizations for certain problems on distributed memory multiprocessor systems are known. In this paper, we present a problem independent general purpose parallel implementa...
متن کاملAdaptive Online Learning for Nonstationary Problems
An adaptation algorithm for online training is examined. For stationary tasks it can reduce the learning rate to reach the best convergence. Instead of simple annealing, it keeps the learning rate exible, such that it can also adapt to nonstationary tasks. Di erent tasks, abrupt or gradual changes, and di erent guidance measures are discussed.
متن کاملComparison of annealing and iterated lters for speckle reduction in SAR
Many of the despeckling lters currently available (Mean, Median, Lee Sigma, Lee MMSE, Kuan, Frost, etc.) operate by smoothing over a xed window, whose size must be decided by two competing factors. Over homogeneous regions large window sizes are needed to improve speckle reduction by averaging. However, a large window size reduces the fundamental resolution of the algorithm, as with multi-looki...
متن کامل